Simulated annealing , weighted simulated an -
نویسنده
چکیده
Two well known stochastic optimization algorithms, simulated annealing and genetic algorithm are compared when using a sample to minimize an objective function which is the expectation of a random variable. Since they lead to minimum depending on the sample, a weighted version of simulated annealing is proposed in order to reduce this kind of overt bias. The algorithms are implemented on an optimization problem related to quality control. A design of experiment is used to get the best trade-oo between optimization and execution time. Simulated annealing appears to be more eecient than the genetic algorithm. With regard to the bias problem, the randomly weighted version of simulated annealing allows to achieve a solution less dependent on the sample and thus less biased.
منابع مشابه
A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملVARIABLE ORDERINGS FOR OBDDs, SIMULATED ANNEALING, AND THE HIDDEN WEIGHTED BIT FUNCTION
Ordered binary decision diagrams (OBDDs) are an eecient graph representation for Boolean functions, if good variable orderings are used. Variable order-ings are computed by heuristic algorithms and improved with the simulated annealing approach. New neighborhoods for simulated annealing algorithms are presented. It is investigated how the OBDD size may change in one iteration step for the diier...
متن کاملOn the Design of an Adaptive Simulated Annealing Algorithm
In this paper, we demonstrate the ease in which an adaptive simulated annealing algorithm can be designed. Specifically, we use the adaptive annealing schedule known as the modified Lam schedule to apply simulated annealing to the weighted tardiness scheduling problem with sequence-dependent setups. The modified Lam annealing schedule adjusts the temperature to track the theoretical optimal rat...
متن کامل